Learning Probabilistic Programs
نویسندگان
چکیده
We develop a technique for generalising from data in which models are samplers represented as program text. We establish encouraging empirical results that suggest that Markov chain Monte Carlo probabilistic programming inference techniques coupled with higher-order probabilistic programming languages are now sufficiently powerful to enable successful inference of this kind in nontrivial domains. We also introduce a new notion of probabilistic program compilation and show how the same machinery might be used in the future to compile probabilistic programs for efficient reusable predictive inference.
منابع مشابه
Inference and Learning in Probabilistic Logic Programs with Continuous Random Variables
of the Dissertation Inference and Learning in Probabilistic Logic Programs with Continuous Random Variables
متن کاملA Probabilistic Model of Learning Fields in Islamic Economics and Finance
In this paper an epistemological model of learning fields of probabilistic events is formalized. It is used to explain resource allocation governed by pervasive complementarities as the sign of unity of knowledge. Such an episteme is induced epistemologically into interacting, integrating and evolutionary variables representing the problem at hand. The end result is the formalization of a p...
متن کاملModeling Cognition with Probabilistic Programs: Representations and Algorithms
This thesis develops probabilistic programming as a productive metaphor for understanding cognition, both with respect to mental representations and the manipulation of such representations. In the first half of the thesis, I demonstrate the representational power of probabilistic programs in the domains of concept learning and social reasoning. I provide examples of richly structured concepts,...
متن کاملA Revised Comparison of Bayesian Logic Programs and Stochastic Logic Programs
This paper presents a revised comparison of Bayesian logic programs (BLPs) and stochastic logic programs (SLPs) based on a previous work. We first explore their semantical differences in terms of probabilistic logic learning settings and first-order probabilistic logics. We then revise BLP-SLP translations to resolve a potential ‘contradictory refutation’ problem. We finally work on the compari...
متن کاملLifted Discriminative Learning of Probabilistic Logic Programs
Probabilistic logic programming (PLP) provides a powerful tool for reasoning with uncertain relational models. However, learning probabilistic logic programs is expensive due to the high cost of inference. Among the proposals to overcome this problem, one of the most promising is lifted inference. In this paper we consider PLP models that are amenable to lifted inference and present an algorith...
متن کاملLearning Probabilistic Programs Using Backpropagation
Probabilistic modeling enables combining domain knowledge with learning from data, thereby supporting learning from fewer training instances than purely data-driven methods. However, learning probabilistic models is difficult and has not achieved the level of performance of methods such as deep neural networks on many tasks. In this paper, we attempt to address this issue by presenting a method...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1407.2646 شماره
صفحات -
تاریخ انتشار 2014